LEXA: A Left-Edge based Crosstalk-Minimum lc-Color Permutation in VHV Channels

Given the channel routing topology with k tracks, the problem of minimizing crosstalk is intractable, requiring O(k!) time even in the track-based permutation. In this paper, a new approach for track assignment enhancement, minimizing the ●ignal cmsatalk and defect areas between netn, while preserving the number of tracks, is presented. The approach is to allow for the split “nets” to be permuted for better crosstalk minimization, rather than simply permuting the tracka. We prea ent a graphbased Aeuriatic running in 0(K.2 ek2 2X-’ -x) time to obtain a near-optimal aohction, where K is the minimum clique cover number in an am ociated interval graph G and e is the number of edges in G. Here the parameter A (< log k) provides a tradeoff between time complexity and Iolution quality. A noble split rainbow k-colour permutation algorithm is propowed based on a dynamic programming approach. Our experiments show a significant improvement; 6.4% (reap. I %) for crosstalk and Jz% (TSSP. 175) for critical areas on dense channela, compared with an initial track aaaignment (reap. the track permutation of the initial track aaaignment). Our algorithm can also be applied to the lower power application such thaj power dissipation due to cro~stalk ia minimized by enmming that wires carrying high actiaity signals are placed sufficiently far from the other wires.